package leetcode100;

// TODO 动态规划 | 状态转移方程 [经典] 【-】 不同路径
// TODO https://leetcode.cn/problems/unique-paths/solution/dong-tai-gui-hua-by-powcai-2/

public class lc100_0062 {

    public int uniquePaths(int m, int n) {
        int[][] dp = new int[m][n];
        // 初始状态
        for (int i=0; i<n; i++)
            dp[0][i] = 1;
        for (int i=0; i<m; i++)
            dp[i][0] = 1;

        // 状态转移方程
        for (int i=1; i<m; i++) {
            for (int j=1; j<n; j++) {
                dp[i][j] = dp[i][j-1] + dp[i-1][j];
            }
        }
        return dp[m-1][n-1];
    }

}